Improving Efficiency of Parallel Vertex-Centric Algorithms for Irregular Graphs
نویسندگان
چکیده
منابع مشابه
Expressing Massively Parallel Algorithms for Irregular Data Expressing Massively Parallel Algorithms for Irregular Data
In this paper we present a data-parallel language called MPL, for which the basic data structure is the graph. The purpose of this language is to program numerical algorithms that use irregular data, and to allow them to execute on distributed memory MIMD machines. We deene the graph data structure and give some examples of how irregular data structures can be described from graphs with our app...
متن کاملIrregular Parallel Algorithms in JAVA
The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data parallelism into the object model of Java by developing a library of collection classes and adding a forall statement to the language. The collection classes provide parallel implementations of operations on the coll...
متن کاملMapping Irregular Parallel Algorithms in Vlsi Processor Arrays Mapping Irregular Parallel Algorithms in Vlsi Processor Arrays ?
The paper presents an overwiev of our recent research of parallel algorithm mapping. We consider the mapping of irregularly structured algorithms in VLSI processor arrays. Although architectural improvements may contribute to the mapping eeciency, the area of mapping techniques is a more likely source for improvements. Therefore, we discused the following topics: optimization of mappings with s...
متن کاملParallel Algorithms for Series Parallel Graphs
In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2019
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2019.2906166